منابع مشابه
Finding Hamiltonian circuits in quasi-adjoint graphs
This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothermic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718–729]. This paper presents a class of digraphs: the quasi-adjoint graphs. This class includes the ones used in the paper cited above. A polynomial recognition alg...
متن کاملCores of random graphs are born Hamiltonian
Let {Gt}t≥0 be the random graph process (G0 is edgeless and Gt is obtained by adding a uniformly distributed new edge to Gt−1), and let τk denote the minimum time t such that the k-core of Gt (its unique maximal subgraph with minimum degree at least k) is nonempty. For any fixed k ≥ 3 the k-core is known to emerge via a discontinuous phase transition, where at time t = τk its size jumps from 0 ...
متن کاملHamiltonian decompositions of random bipartite regular graphs
We prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Ha...
متن کاملHamiltonian completions of sparse random graphs
Given a (directed or undirected) graph G, finding the smallest number of additional edges which make the graph Hamiltonian is called the Hamiltonian Completion Problem (HCP). We consider this problem in the context of sparse random graphs G(n, c/n) on n nodes, where each edge is selected independently with probability c/n. We give a complete asymptotic answer to this problem when c < 1, by cons...
متن کاملSparse pseudo-random graphs are Hamiltonian
In this article we study Hamilton cycles in sparse pseudorandom graphs. We prove that if the second largest absolute value of an eigenvalue of a d-regular graph G on n vertices satisfies
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1976
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90068-6